An intermittently served discrete time queue with applications to meteor scatter communications
نویسندگان
چکیده
منابع مشابه
Ax.25 Packet Radio Communications Using Meteor Scatter Propagation
Among radio amateurs digital meteor burst communication has been discussed for many years. Despite this, no experiments on amateur basis have (to the knowledge of the author) been performed in Sweden or elsewhere in the world. During the past two years several amateurs have reported the random appearance of AX.25 packets from very distant stations. The propagation of these packets can only be e...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION
This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysi...
متن کاملContinuous-time consensus with discrete-time communications
This paper addresses the problem of reaching consensus among a group of agents that evolve in continuous-time and exchange information at discretetime instants, referred to as update times. Each agent has its own sequence of update times and therefore the agents are not required to keep synchronized clocks among them. At each update time, an agent receives from a subset of the other agents thei...
متن کاملA discrete-time queue with customers with geometric deadlines
This paper studies a discrete-time queueing system where each customer has a maximum allowed sojourn time in the system, referred to as the “deadline” of the customer. More specifically, we model the deadlines of the consecutive customers as independent and geometrically distributed random variables. Customers enter the system according to a general independent arrival process, i.e., the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 1988
ISSN: 0257-0130,1572-9443
DOI: 10.1007/bf01159085